A note on tree isomorphisms

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Isomorphisms Between Canonical Frames

This paper looks at the question of what kinds of automorphisms and isomorphisms can exist within and between canonical frames for modal logics. Specifically, this paper is able to partially answer the question posed by the author in [7] of whether FL ! = FL !1 in the presence of the extra-ZFC axiom “2! = 2!1 .” We answer the question in the negative for all logics below S5 and for all logics s...

متن کامل

Note on the Group of Isomorphisms*

LET SV a2, ••', sg represent all the operators of a group G and let tasa correspond to sa (a = 1, 2, •••, g) in any given simple isomorphism of G with itself. I t is evident that ta is some operator of G. When G is abelian these £a's must constitute a group T which is isomorphic with (?.* In this isomorphism, ta evidently can not be the inverse of sa unless sa = 1. As this condition is sufficie...

متن کامل

A note on lifting isomorphisms of modules over PIDs

This note has been written to supplement Keith Conrad’s [1], though it is largely independent of the latter. I am going to show some (rather elementary) properties of free modules over PIDs and apply them to drop the “full submodule” resp. “nonzero determinant” restraints which qualify many statements made in [1]. Thanks are due to Keith Conrad for a correction and helpful remarks. The LaTeX so...

متن کامل

A note on isomorphisms of Cayley digraphs of Abelian groups

Let Sand T be two minimal generating s~bsets of a finite abelian group G. We prove that if Cay(G, S) ~ Cay(G, T) then there exists an a E Aut(G) such that SOl = T. Let G be a finite group and S a subset of G not containing the identity element 1. The Cayley digraph X = Cay( G, S) of G with respect to S is defined by V(X) = G, E(X) = {(g,sg) I 9 E G,s E S}. It is easy to check that if a is an au...

متن کامل

Generating-tree isomorphisms for pattern-avoiding involutions∗

We show that for k ≥ 5 and the permutations τk = (k − 1)k(k − 2) . . . 312 and Jk = k(k − 1) . . . 21, the generating tree for involutions avoiding the pattern τk is isomorphic to the generating tree for involutions avoiding the pattern Jk. This implies a family of Wilf equivalences for pattern avoidance by involutions; at least the first member of this family cannot follow from any type of pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 1974

ISSN: 0095-8956

DOI: 10.1016/0095-8956(74)90064-1